<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    680. Valid Palindrome II
   </h1>
   <p>
    Given a non-empty string
    <code>
     s
    </code>
    , you may delete
    <b>
     at most
    </b>
    one character.  Judge whether you can make it a palindrome.
   </p>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> "aba"
<b>Output:</b> True
</pre>
   <p>
    <b>
     Example 2:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> "abca"
<b>Output:</b> True
<b>Explanation:</b> You could delete the character 'c'.
</pre>
   <p>
    <b>
     Note:
    </b>
    <br>
   </p>
   <ol>
    <li>
     The string will only contain lowercase characters a-z.
The maximum length of the string is 50000.
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    680. 验证回文字符串 Ⅱ
   </h1>
   <p>
    给定一个非空字符串&nbsp;
    <code>
     s
    </code>
    ，
    <strong>
     最多
    </strong>
    删除一个字符。判断是否能成为回文字符串。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> "aba"
<strong>输出:</strong> True
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> "abca"
<strong>输出:</strong> True
<strong>解释:</strong> 你可以删除c字符。
</pre>
   <p>
    <strong>
     注意:
    </strong>
   </p>
   <ol>
    <li>
     字符串只包含从 a-z 的小写字母。字符串的最大长度是50000。
    </li>
   </ol>
  </div>
 </body>
</html>